Enumeration of difference graphs
نویسندگان
چکیده
منابع مشابه
Enumeration of Difference Graphs
A difference graph is a bipartite graph G = (X, Y: E) such that all the neighborhoods of the vertices of X are comparable by inclusion. We enumerate labeled and unlabeled difference graphs with or without a bipartition of the vertices into two stable sets. The labeled enumerations are expressed in terms of combinatorial numbers related to the Stirling numbers of the second kind.
متن کاملSkolem Odd Difference Mean Graphs
In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...
متن کامل$k$-Total difference cordial graphs
Let $G$ be a graph. Let $f:V(G)to{0,1,2, ldots, k-1}$ be a map where $k in mathbb{N}$ and $k>1$. For each edge $uv$, assign the label $left|f(u)-f(v)right|$. $f$ is called a $k$-total difference cordial labeling of $G$ if $left|t_{df}(i)-t_{df}(j)right|leq 1$, $i,j in {0,1,2, ldots, k-1}$ where $t_{df}(x)$ denotes the total number of vertices and the edges labeled with $x$.A graph with admits a...
متن کاملEnumeration of cospectral graphs
We have enumerated all graphs on at most 11 vertices and determined their spectra with respect to various matrices, such as the adjacency matrix and the Laplacian matrix. We have also counted the numbers for which there is at least one other graph with the same spectrum (a cospectral mate). In addition we consider a construction for pairs of cospectral graphs due to Godsil and McKay, which we c...
متن کاملA CHARACTERIZATION FOR METRIC TWO-DIMENSIONAL GRAPHS AND THEIR ENUMERATION
The textit{metric dimension} of a connected graph $G$ is the minimum number of vertices in a subset $B$ of $G$ such that all other vertices are uniquely determined by their distances to the vertices in $B$. In this case, $B$ is called a textit{metric basis} for $G$. The textit{basic distance} of a metric two dimensional graph $G$ is the distance between the elements of $B$. Givi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1995
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00061-h